________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 11:37:19
Input Data from:  dataset159.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,061
Average f[i]   :4600
Average g[i,j] :2027,45098039216
Total demand   :10620
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 18
> Selected Move:	1000	1	-1	18	5000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0    >new incumb.: 1000


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 81
> Selected Move:	1530	1	-1	5	10500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0    >new incumb.: 1530


> New S[]: 
	
	 1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 97
> Selected Move:	2030	1	-1	10	17000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0    >new incumb.: 2030


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 108
> Selected Move:	2700	1	-1	14	22500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  1  0    >new incumb.: 2700


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 109
> Selected Move:	2990	3	1	17	24100


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  1  0  0  0  1  0  0  3  1  0    >new incumb.: 2990


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 81
> Selected Move:	2990	4	17	10	24500


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  3  0  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 77
> Selected Move:	2990	3	18	3	23500


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  3  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 93
> Selected Move:	2990	4	10	5	24100


> New Y[]: 
	
	 2  0  4  1  0  3  0  0  0  0  1  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 83
> Selected Move:	2990	4	5	14	24400


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  1  0  0  0  3  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 73
> Selected Move:	2990	4	14	17	23100


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  1  0  0  0  1  0  0  3  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 103
> Selected Move:	2990	3	3	6	24100


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  1  0  0  0  1  0  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 80
> Selected Move:	2990	4	17	10	24500


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  3  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 75
> Selected Move:	2943	4	10	5	25100


> New Y[]: 
	
	 2  0  4  0  0  3  1  0  0  0  1  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 75
> Selected Move:	2944	3	6	18	25100


> New Y[]: 
	
	 2  0  4  0  0  3  0  0  0  0  1  0  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 74
> Selected Move:	2806	4	5	14	25400


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  1  0  0  0  3  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 76
> Selected Move:	2865	3	14	11	25100


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  1  3  0  0  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 77
> Selected Move:	2910	3	18	3	24100


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  1  3  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 87
> Selected Move:	2910	4	11	10	24500


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  3  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 79
> Selected Move:	2910	4	10	17	24100


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  1  1  0  0  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 89
> Selected Move:	2867	4	17	5	25100


> New Y[]: 
	
	 2  0  4  1  0  3  0  0  0  0  1  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 20 #######################


> Neighbours evaluated; 92
> Selected Move:	2770	3	10	14	24100


> New Y[]: 
	
	 2  0  4  1  0  3  0  0  0  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 21 #######################


> Neighbours evaluated; 90
> Selected Move:	2820	3	5	10	24500


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  3  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,45

## ITERATION 22 #######################


> Neighbours evaluated; 77
> Selected Move:	2880	3	11	13	24500


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  3  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,445

## ITERATION 23 #######################


> Neighbours evaluated; 76
> Selected Move:	2880	4	10	13	24400


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  0  0  3  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,44

## ITERATION 24 #######################


> Neighbours evaluated; 77
> Selected Move:	2880	4	13	17	24100


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  0  0  1  1  0  0  3  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,435

## ITERATION 25 #######################


> Neighbours evaluated; 89
> Selected Move:	2837	3	3	6	25100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  0  0  1  1  0  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,43

## ITERATION 26 #######################


> Neighbours evaluated; 77
> Selected Move:	2837	3	6	18	25100


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  0  0  1  1  0  0  3  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0 
 > pw :0,425

## ITERATION 27 #######################


> Neighbours evaluated; 76
> Selected Move:	2778	3	13	11	25100


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  1  0  0  1  0  0  3  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0 
 > pw :0,42

## ITERATION 28 #######################


> Neighbours evaluated; 76
> Selected Move:	2868	3	14	5	25100


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  1  1  0  0  0  0  0  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 29 #######################


> Neighbours evaluated; 76
> Selected Move:	2868	3	18	6	25100


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  1  1  0  0  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 30 #######################


> Neighbours evaluated; 75
> Selected Move:	2867	4	17	11	25100


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  1  3  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 31 #######################


> Neighbours evaluated; 75
> Selected Move:	2816	3	11	14	25400


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  1  0  0  0  3  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,44

## ITERATION 32 #######################


> Neighbours evaluated; 77
> Selected Move:	2740	3	17	9	24400


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  1  1  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 33 #######################


> Neighbours evaluated; 81
> Selected Move:	2740	4	14	5	24100


> New Y[]: 
	
	 2  0  4  0  0  3  1  0  0  1  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 34 #######################


> Neighbours evaluated; 86
> Selected Move:	2740	4	5	9	24000


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  3  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 35 #######################


> Neighbours evaluated; 86
> Selected Move:	2760	3	9	11	24100


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  1  3  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 36 #######################


> Neighbours evaluated; 87
> Selected Move:	2774	3	5	17	25100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  3  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,465

## ITERATION 37 #######################


> Neighbours evaluated; 75
> Selected Move:	2820	3	6	3	24100


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  3  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,47

## ITERATION 38 #######################


> Neighbours evaluated; 81
> Selected Move:	2820	4	11	17	24100


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  1  0  0  1  0  0  3  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,465

## ITERATION 39 #######################


> Neighbours evaluated; 89
> Selected Move:	2774	3	3	6	25100


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  1  0  0  1  0  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,46

## ITERATION 40 #######################


> Neighbours evaluated; 73
> Selected Move:	2770	3	10	5	24100


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  1  0  0  1  0  0  3  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 41 #######################


> Neighbours evaluated; 86
> Selected Move:	2770	4	17	11	24100


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  3  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 42 #######################


> Neighbours evaluated; 86
> Selected Move:	2770	3	6	3	23100


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  0  3  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 43 #######################


> Neighbours evaluated; 101
> Selected Move:	2770	4	11	14	24400


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  0  1  0  0  3  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 44 #######################


> Neighbours evaluated; 84
> Selected Move:	2770	4	14	17	23100


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  0  1  0  0  1  0  0  3  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 45 #######################


> Neighbours evaluated; 102
> Selected Move:	2770	3	3	18	24100


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  1  0  0  1  0  0  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,43

## ITERATION 46 #######################


> Neighbours evaluated; 79
> Selected Move:	2770	4	17	11	24100


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  3  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 47 #######################


> Neighbours evaluated; 79
> Selected Move:	2778	3	5	10	25100


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  3  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0 
 > pw :0,42

## ITERATION 48 #######################


> Neighbours evaluated; 75
> Selected Move:	2780	3	11	1	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0 
 > pw :0,415

## ITERATION 49 #######################


> Neighbours evaluated; 105
> Selected Move:	2950	3	18	5	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0 
 > pw :0,41

## ITERATION 50 #######################


> Neighbours evaluated; 105
> Selected Move:	2910	3	14	11	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 51 #######################


> Neighbours evaluated; 102
> Selected Move:	2820	3	5	14	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,4

## ITERATION 52 #######################


> Neighbours evaluated; 104
> Selected Move:	2880	3	11	13	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,395

## ITERATION 53 #######################


> Neighbours evaluated; 103
> Selected Move:	2780	3	10	18	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  1  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,39

## ITERATION 54 #######################


> Neighbours evaluated; 109
> Selected Move:	2740	3	13	11	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,385

## ITERATION 55 #######################


> Neighbours evaluated; 107
> Selected Move:	2770	3	14	10	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  0  0  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,38

## ITERATION 56 #######################


> Neighbours evaluated; 106
> Selected Move:	2740	3	17	14	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 57 #######################


> Neighbours evaluated; 109
> Selected Move:	2760	3	18	5	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  1  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 58 #######################


> Neighbours evaluated; 107
> Selected Move:	2770	3	10	17	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 59 #######################


> Neighbours evaluated; 107
> Selected Move:	2730	3	11	18	22500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,36

## ITERATION 60 #######################


> Neighbours evaluated; 112
> Selected Move:	2700	3	0	10	24000


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  2  0  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,355

## ITERATION 61 #######################


> Neighbours evaluated; 88
> Selected Move:	2740	3	5	11	25000


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  2  1  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0 
 > pw :0,35

## ITERATION 62 #######################


> Neighbours evaluated; 81
> Selected Move:	2690	3	11	13	25000


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  2  0  0  1  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,345

## ITERATION 63 #######################


> Neighbours evaluated; 76
> Selected Move:	2650	3	17	11	25000


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  2  1  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,34

## ITERATION 64 #######################


> Neighbours evaluated; 78
> Selected Move:	2680	3	10	0	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,335

## ITERATION 65 #######################


> Neighbours evaluated; 115
> Selected Move:	2690	3	11	10	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,33

## ITERATION 66 #######################


> Neighbours evaluated; 114
> Selected Move:	2690	3	2	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  4  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,325

## ITERATION 67 #######################


> Neighbours evaluated; 80
> Selected Move:	2740	3	13	11	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  0  1  0  0  4  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0 
 > pw :0,32

## ITERATION 68 #######################


> Neighbours evaluated; 80
> Selected Move:	2700	3	11	5	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  4  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,315

## ITERATION 69 #######################


> Neighbours evaluated; 84
> Selected Move:	2700	4	17	10	24400


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  4  0  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,31

## ITERATION 70 #######################


> Neighbours evaluated; 82
> Selected Move:	2669	4	10	5	25100


> New Y[]: 
	
	 2  3  0  0  0  4  0  0  0  0  1  0  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,305

## ITERATION 71 #######################


> Neighbours evaluated; 79
> Selected Move:	2618	3	5	11	25400


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  4  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0 
 > pw :0,3

## ITERATION 72 #######################


> Neighbours evaluated; 78
> Selected Move:	2640	3	18	3	24400


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  4  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0 
 > pw :0,295

## ITERATION 73 #######################


> Neighbours evaluated; 76
> Selected Move:	2680	3	11	2	22500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0 
 > pw :0,29

## ITERATION 74 #######################


> Neighbours evaluated; 109
> Selected Move:	2680	3	10	13	22500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0 
 > pw :0,285

## ITERATION 75 #######################


> Neighbours evaluated; 115
> Selected Move:	2660	3	1	11	24100


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  3  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 76 #######################


> Neighbours evaluated; 99
> Selected Move:	2772	3	14	10	25100


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  3  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 77 #######################


> Neighbours evaluated; 93
> Selected Move:	2773	4	11	17	25100


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  1  0  1  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 78 #######################


> Neighbours evaluated; 96
> Selected Move:	2692	4	17	13	25400


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  1  0  3  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 79 #######################


> Neighbours evaluated; 94
> Selected Move:	2710	3	13	14	25400


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  1  0  0  3  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,28

## ITERATION 80 #######################


> Neighbours evaluated; 99
> Selected Move:	2768	3	11	13	25400


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  0  0  1  3  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,285

## ITERATION 81 #######################


> Neighbours evaluated; 100
> Selected Move:	2640	3	13	16	23400


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  0  0  0  3  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 82 #######################


> Neighbours evaluated; 111
> Selected Move:	2640	4	14	3	25000


> New Y[]: 
	
	 2  0  4  3  0  0  0  0  0  0  1  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 83 #######################


> Neighbours evaluated; 91
> Selected Move:	2695	3	16	5	26000


> New Y[]: 
	
	 2  0  4  3  0  1  0  0  0  0  1  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,3

## ITERATION 84 #######################


> Neighbours evaluated; 92
> Selected Move:	2740	3	17	9	25000


> New Y[]: 
	
	 2  0  4  3  0  1  0  0  0  1  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 85 #######################


> Neighbours evaluated; 89
> Selected Move:	2740	4	3	5	23100


> New Y[]: 
	
	 2  0  4  1  0  3  0  0  0  1  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 86 #######################


> Neighbours evaluated; 109
> Selected Move:	2760	3	9	11	24100


> New Y[]: 
	
	 2  0  4  1  0  3  0  0  0  0  1  1  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 87 #######################


> Neighbours evaluated; 100
> Selected Move:	2760	4	5	10	23500


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  3  1  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 88 #######################


> Neighbours evaluated; 106
> Selected Move:	2760	4	10	11	23100


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  1  3  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 89 #######################


> Neighbours evaluated; 105
> Selected Move:	2760	4	11	14	24400


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  1  1  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 90 #######################


> Neighbours evaluated; 103
> Selected Move:	2740	3	11	9	23400


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  1  1  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 91 #######################


> Neighbours evaluated; 107
> Selected Move:	2740	4	14	9	23000


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  3  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 92 #######################


> Neighbours evaluated; 106
> Selected Move:	2740	4	9	10	22500


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  1  3  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 93 #######################


> Neighbours evaluated; 108
> Selected Move:	2740	3	3	6	23500


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  1  3  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 94 #######################


> Neighbours evaluated; 107
> Selected Move:	2760	3	9	11	24500


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  3  1  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 95 #######################


> Neighbours evaluated; 100
> Selected Move:	2773	3	14	17	25500


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  3  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 96 #######################


> Neighbours evaluated; 94
> Selected Move:	2775	3	6	18	25500


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  3  1  0  0  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,265

## ITERATION 97 #######################


> Neighbours evaluated; 89
> Selected Move:	2760	3	17	14	24500


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  3  1  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,26

## ITERATION 98 #######################


> Neighbours evaluated; 97
> Selected Move:	2760	4	10	11	24100


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  1  3  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,255

## ITERATION 99 #######################


> Neighbours evaluated; 100
> Selected Move:	2740	3	11	9	24000


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  3  1  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,25

## ITERATION 100 #######################


> Neighbours evaluated; 99
> Selected Move:	2740	4	9	5	24100


> New Y[]: 
	
	 2  0  4  0  0  3  0  0  0  1  1  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,245

## ITERATION 101 #######################


> Neighbours evaluated; 100
> Selected Move:	2740	4	5	10	23500


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  1  3  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,24

## ITERATION 102 #######################


> Neighbours evaluated; 103
> Selected Move:	2740	4	10	14	24400


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  1  1  0  0  0  3  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 103 #######################


> Neighbours evaluated; 96
> Selected Move:	2717	4	14	18	25100


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  1  1  0  0  0  1  0  0  0  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 104 #######################


> Neighbours evaluated; 106
> Selected Move:	2740	3	18	1	23000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 105 #######################


> Neighbours evaluated; 116
> Selected Move:	2690	3	5	18	22500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  1  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,22

## ITERATION 106 #######################


> Neighbours evaluated; 115
> Selected Move:	2630	3	1	13	24400


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  1  1  0  0  3  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,215

## ITERATION 107 #######################


> Neighbours evaluated; 100
> Selected Move:	2794	3	9	17	25400


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  1  0  0  3  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0 
 > pw :0,21

## ITERATION 108 #######################


> Neighbours evaluated; 84
> Selected Move:	2796	3	18	6	25400


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  1  0  0  3  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,205

## ITERATION 109 #######################


> Neighbours evaluated; 98
> Selected Move:	2778	4	13	10	25500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  3  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,2

## ITERATION 110 #######################


> Neighbours evaluated; 102
> Selected Move:	2780	3	6	18	25500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  3  0  0  1  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0 
 > pw :0,205

## ITERATION 111 #######################


> Neighbours evaluated; 90
> Selected Move:	2718	3	13	11	25500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  3  1  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0 
 > pw :0,21

## ITERATION 112 #######################


> Neighbours evaluated; 90
> Selected Move:	2749	3	10	5	25100


> New Y[]: 
	
	 2  0  4  0  0  3  0  0  0  0  0  1  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,215

## ITERATION 113 #######################


> Neighbours evaluated; 88
> Selected Move:	2749	3	18	6	25100


> New Y[]: 
	
	 2  0  4  0  0  3  1  0  0  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 114 #######################


> Neighbours evaluated; 98
> Selected Move:	2738	3	17	10	25100


> New Y[]: 
	
	 2  0  4  0  0  3  1  0  0  0  1  1  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 115 #######################


> Neighbours evaluated; 99
> Selected Move:	2738	3	6	18	25100


> New Y[]: 
	
	 2  0  4  0  0  3  0  0  0  0  1  1  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 116 #######################


> Neighbours evaluated; 93
> Selected Move:	2668	4	5	14	25400


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  1  1  0  0  3  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 117 #######################


> Neighbours evaluated; 98
> Selected Move:	2676	3	10	17	25400


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  1  0  0  3  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,24

## ITERATION 118 #######################


> Neighbours evaluated; 86
> Selected Move:	2700	3	11	19	24900


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  0  3  0  0  1  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,245

## ITERATION 119 #######################


> Neighbours evaluated; 83
> Selected Move:	2700	4	14	5	24600


> New Y[]: 
	
	 2  0  4  0  0  3  0  0  0  0  0  0  0  0  1  0  0  1  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,25

## ITERATION 120 #######################


> Neighbours evaluated; 84
> Selected Move:	2700	4	5	17	23600


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  0  1  0  0  3  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,255

## ITERATION 121 #######################


> Neighbours evaluated; 91
> Selected Move:	2700	4	17	19	24100


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,26

## ITERATION 122 #######################


> Neighbours evaluated; 87
> Selected Move:	2700	3	18	3	23100


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  3 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 123 #######################


> Neighbours evaluated; 110
> Selected Move:	2700	4	19	5	23600


> New Y[]: 
	
	 2  0  4  1  0  3  0  0  0  0  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 124 #######################


> Neighbours evaluated; 107
> Selected Move:	2700	4	5	14	23900


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  0  0  0  0  3  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 125 #######################


> Neighbours evaluated; 105
> Selected Move:	2700	4	14	17	22600


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  0  0  0  0  1  0  0  3  0  1 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 126 #######################


> Neighbours evaluated; 108
> Selected Move:	2700	3	3	6	23600


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  0  0  0  1  0  0  3  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 127 #######################


> Neighbours evaluated; 106
> Selected Move:	2700	4	17	5	24600


> New Y[]: 
	
	 2  0  4  0  0  3  1  0  0  0  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 128 #######################


> Neighbours evaluated; 96
> Selected Move:	2700	4	5	14	24900


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  0  0  0  3  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 129 #######################


> Neighbours evaluated; 93
> Selected Move:	2700	4	14	19	24100


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  0  0  0  0  1  0  0  1  0  3 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 130 #######################


> Neighbours evaluated; 104
> Selected Move:	2637	3	14	10	25100


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  1  0  0  0  0  0  0  1  0  3 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 131 #######################


> Neighbours evaluated; 103
> Selected Move:	2660	4	19	10	25000


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  3  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 132 #######################


> Neighbours evaluated; 102
> Selected Move:	2660	4	10	17	24600


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  0  0  1  0  0  0  0  0  0  3  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 133 #######################


> Neighbours evaluated; 106
> Selected Move:	2660	3	6	3	23600


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  1  0  0  0  0  0  0  3  0  1 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 134 #######################


> Neighbours evaluated; 109
> Selected Move:	2660	4	17	5	24600


> New Y[]: 
	
	 2  0  4  1  0  3  0  0  0  0  1  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 135 #######################


> Neighbours evaluated; 107
> Selected Move:	2660	4	5	10	24000


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  3  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 136 #######################


> Neighbours evaluated; 106
> Selected Move:	2660	4	10	19	24100


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  3 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 137 #######################


> Neighbours evaluated; 107
> Selected Move:	2650	3	19	7	24600


> New Y[]: 
	
	 2  0  4  1  0  1  0  3  0  0  1  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 138 #######################


> Neighbours evaluated; 103
> Selected Move:	2650	4	7	3	25000


> New Y[]: 
	
	 2  0  4  3  0  1  0  1  0  0  1  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 139 #######################


> Neighbours evaluated; 103
> Selected Move:	2650	4	3	5	23100


> New Y[]: 
	
	 2  0  4  1  0  3  0  1  0  0  1  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 140 #######################


> Neighbours evaluated; 109
> Selected Move:	2652	1	-1	14	28600


> New Y[]: 
	
	 2  0  4  1  0  3  0  1  0  0  1  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,175

## ITERATION 141 #######################


> Neighbours evaluated; 101
> Selected Move:	2845	4	5	17	27600


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  0  0  1  0  0  0  1  0  0  3  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,17

## ITERATION 142 #######################


> Neighbours evaluated; 112
> Selected Move:	2878	3	7	16	27600


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  1  0  0  0  1  0  1  3  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 143 #######################


> Neighbours evaluated; 117
> Selected Move:	2825	4	17	10	28000


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  3  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 144 #######################


> Neighbours evaluated; 119
> Selected Move:	2830	3	10	1	26000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,165

## ITERATION 145 #######################


> Neighbours evaluated; 124
> Selected Move:	2800	3	5	7	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,17

## ITERATION 146 #######################


> Neighbours evaluated; 124
> Selected Move:	2770	3	16	5	26000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  0  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,175

## ITERATION 147 #######################


> Neighbours evaluated; 116
> Selected Move:	2775	3	1	10	28000


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  0  0  3  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,18

## ITERATION 148 #######################


> Neighbours evaluated; 109
> Selected Move:	2740	3	17	16	26000


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  0  0  3  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 149 #######################


> Neighbours evaluated; 116
> Selected Move:	2739	3	10	17	25600


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  0  0  0  0  0  0  1  0  1  3  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 150 #######################


> Neighbours evaluated; 118
> Selected Move:	2656	3	7	15	25600


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  0  0  0  0  1  1  1  3  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 151 #######################


> Neighbours evaluated; 119
> Selected Move:	2713	3	16	10	27600


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  1  0  0  0  1  1  0  3  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,2

## ITERATION 152 #######################


> Neighbours evaluated; 116
> Selected Move:	2630	3	17	1	26000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  1  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 153 #######################


> Neighbours evaluated; 124
> Selected Move:	2755	3	15	16	26000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  1  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 154 #######################


> Neighbours evaluated; 118
> Selected Move:	2780	3	10	9	25000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  1  0  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 155 #######################


> Neighbours evaluated; 125
> Selected Move:	2735	3	5	10	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  1  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,22

## ITERATION 156 #######################


> Neighbours evaluated; 120
> Selected Move:	2770	3	9	7	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  1  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,225

## ITERATION 157 #######################


> Neighbours evaluated; 121
> Selected Move:	2690	3	7	15	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,23

## ITERATION 158 #######################


> Neighbours evaluated; 125
> Selected Move:	2720	3	10	17	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,235

## ITERATION 159 #######################


> Neighbours evaluated; 118
> Selected Move:	2625	3	16	5	26000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  0  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,24

## ITERATION 160 #######################


> Neighbours evaluated; 110
> Selected Move:	2650	3	17	9	25000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  1  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,245

## ITERATION 161 #######################


> Neighbours evaluated; 126
> Selected Move:	2730	3	15	7	25000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  1  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,24

## ITERATION 162 #######################


> Neighbours evaluated; 126
> Selected Move:	2670	3	9	10	26000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  0  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,235

## ITERATION 163 #######################


> Neighbours evaluated; 101
> Selected Move:	2665	3	5	9	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  1  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,23

## ITERATION 164 #######################


> Neighbours evaluated; 113
> Selected Move:	2630	3	7	5	27000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  1  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,235

## ITERATION 165 #######################


> Neighbours evaluated; 96
> Selected Move:	2600	2	9	-1	21500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,23

## ITERATION 166 #######################


> Neighbours evaluated; 109
> Selected Move:	2640	3	5	11	22500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  1  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 167 #######################


> Neighbours evaluated; 111
> Selected Move:	2670	3	14	17	23500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,22

## ITERATION 168 #######################


> Neighbours evaluated; 110
> Selected Move:	2640	3	10	14	22500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,215

## ITERATION 169 #######################


> Neighbours evaluated; 109
> Selected Move:	2660	3	1	13	24400


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  1  0  3  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 170 #######################


> Neighbours evaluated; 99
> Selected Move:	2660	4	13	17	24100


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  1  0  1  1  0  0  3  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 171 #######################


> Neighbours evaluated; 102
> Selected Move:	2650	3	17	10	24500


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  3  1  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 172 #######################


> Neighbours evaluated; 108
> Selected Move:	2700	3	14	17	25500


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  3  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 173 #######################


> Neighbours evaluated; 107
> Selected Move:	2582	3	10	14	25400


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  1  0  1  3  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 174 #######################


> Neighbours evaluated; 103
> Selected Move:	2590	3	11	19	24900


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  0  1  3  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 175 #######################


> Neighbours evaluated; 104
> Selected Move:	2630	3	13	10	24900


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  0  0  0  3  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,18

## ITERATION 176 #######################


> Neighbours evaluated; 104
> Selected Move:	2630	4	14	10	24000


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  3  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,175

## ITERATION 177 #######################


> Neighbours evaluated; 108
> Selected Move:	2640	3	19	16	22500


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  3  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 178 #######################


> Neighbours evaluated; 107
> Selected Move:	2640	4	10	16	25000


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  0  0  0  1  0  3  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 179 #######################


> Neighbours evaluated; 104
> Selected Move:	2640	4	16	17	22100


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  0  0  0  1  0  1  3  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 180 #######################


> Neighbours evaluated; 106
> Selected Move:	2694	1	-1	7	26600


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  0  0  1  0  0  0  1  0  1  3  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 181 #######################


> Neighbours evaluated; 115
> Selected Move:	2682	3	14	5	26600


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  0  0  1  0  0  0  0  0  1  3  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 182 #######################


> Neighbours evaluated; 115
> Selected Move:	2680	3	16	11	28600


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  0  0  1  1  0  0  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 183 #######################


> Neighbours evaluated; 111
> Selected Move:	2833	3	7	14	29600


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  1  1  0  0  1  0  0  3  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,14

## ITERATION 184 #######################


> Neighbours evaluated; 107
> Selected Move:	2856	4	17	11	29600


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  1  3  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,145

## ITERATION 185 #######################


> Neighbours evaluated; 111
> Selected Move:	2775	4	11	10	30000


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  3  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,15

## ITERATION 186 #######################


> Neighbours evaluated; 106
> Selected Move:	2770	3	11	15	28000


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  3  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,155

## ITERATION 187 #######################


> Neighbours evaluated; 115
> Selected Move:	2685	3	17	16	26000


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  3  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 188 #######################


> Neighbours evaluated; 117
> Selected Move:	2780	3	15	9	27000


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  1  3  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 189 #######################


> Neighbours evaluated; 114
> Selected Move:	2720	3	16	7	27000


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  0  1  3  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 190 #######################


> Neighbours evaluated; 113
> Selected Move:	2630	3	7	15	27000


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  1  3  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 191 #######################


> Neighbours evaluated; 115
> Selected Move:	2550	3	15	11	29000


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  1  3  1  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 192 #######################


> Neighbours evaluated; 108
> Selected Move:	2630	3	10	1	27000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,185

## ITERATION 193 #######################


> Neighbours evaluated; 118
> Selected Move:	2675	3	9	16	26000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  0  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,19

## ITERATION 194 #######################


> Neighbours evaluated; 123
> Selected Move:	2670	3	5	7	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  0  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,195

## ITERATION 195 #######################


> Neighbours evaluated; 126
> Selected Move:	2680	3	11	13	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  0  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,2

## ITERATION 196 #######################


> Neighbours evaluated; 125
> Selected Move:	2660	3	7	9	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 197 #######################


> Neighbours evaluated; 125
> Selected Move:	2645	3	13	11	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 198 #######################


> Neighbours evaluated; 123
> Selected Move:	2615	3	11	19	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 199 #######################


> Neighbours evaluated; 125
> Selected Move:	2623	3	9	5	25500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,22

## ITERATION 200 #######################


> Neighbours evaluated; 122
> Selected Move:	2610	3	14	9	25500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 201 #######################


> Neighbours evaluated; 126
> Selected Move:	2590	3	19	7	24000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  1  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 202 #######################


> Neighbours evaluated; 126
> Selected Move:	2690	3	3	18	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1  0  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 203 #######################


> Neighbours evaluated; 128
> Selected Move:	2700	3	9	14	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,24

## ITERATION 204 #######################


> Neighbours evaluated; 128
> Selected Move:	2690	3	5	9	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,245
________________________________________________________________

Best solution found: 2990
Run Termination time: 31.01.2010 11:40:57
Run duration: 00:03:37.3281250
________________________________________________________________
